Comparing fixed and variable-width Gaussian networks
نویسندگان
چکیده
The role of width of Gaussians in two types of computational models is investigated: Gaussian radial-basis-functions (RBFs) where both widths and centers vary and Gaussian kernel networks which have fixed widths but varying centers. The effect of width on functional equivalence, universal approximation property, and form of norms in reproducing kernel Hilbert spaces (RKHS) is explored. It is proven that if two Gaussian RBF networks have the same input-output functions, then they must have the same numbers of units with the same centers and widths. Further, it is shown that while sets of input-output functions of Gaussian kernel networks with two different widths are disjoint, each such set is large enough to be a universal approximator. Embedding of RKHSs induced by "flatter" Gaussians into RKHSs induced by "sharper" Gaussians is described and growth of the ratios of norms on these spaces with increasing input dimension is estimated. Finally, large sets of argminima of error functionals in sets of input-output functions of Gaussian RBFs are described.
منابع مشابه
Kernel Networks with Fixed and Variable Widths
The role of width in kernel models and radial-basis function networks is investigated with a special emphasis on the Gaussian case. Quantitative bounds are given on kernel-based regularization showing the effect of changing the width. These bounds are shown to be d-th powers of width ratios, and so they are exponential in the dimension of input data.
متن کاملNonextensive aspects of small - world networks 1
We have discussed the nonextensive aspects of degree distribution P (k) in Watts-Strogatz (WS) small-world networks by using the three approaches: (a) the maximum-entropy method, (b) hidden-variable distribution and (c) stochastic differential equation. In the method (a), P (k) in complex networks has been obtained by maximizing the nonexten-sive information entropy with the constraint of < k 2...
متن کاملNonextensive aspects of small-world networks
We have discussed the nonextensive aspects of degree distribution P (k) in Watts-Strogatz (WS) small-world networks by using the three approaches: (a) the maximum-entropy method, (b) hidden-variable distribution and (c) stochastic differential equation. In the method (a), P (k) in complex networks has been obtained by maximizing the nonextensive information entropy with the three constraints: <...
متن کاملRegression Analysis under Inverse Gaussian Model: Repeated Observation Case
Traditional regression analyses assume normality of observations and independence of mean and variance. However, there are many examples in science and Technology where the observations come from a skewed distribution and moreover there is a functional dependence between variance and mean. In this article, we propose a method for regression analysis under Inverse Gaussian model when th...
متن کاملNetworks which learn to store variable-length sequences in a fixed set of unit activations
A method for storing sequences of varying lengths in a fixed-width vector is described. The method is implemented, in an adaptive form, in a recurrent network which learns to generate sequences. The performance of this network is compared with that of a more conventional recurrent network on the same task.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Neural networks : the official journal of the International Neural Network Society
دوره 57 شماره
صفحات -
تاریخ انتشار 2014